1208C - Magic Grid - CodeForces Solution


constructive algorithms *1800

Please click on ads to support us..

C++ Code:

#include<iostream>
#include<algorithm>
using namespace std;
int a[1024][1024];
int main()
{
    int n,cnt=0;
    cin>>n;
    for(int i=1;i<=n;i+=4)
    for(int j=1;j<=n;j+=4){
    	for(int x=0;x<4;x++)
    	for(int y=0;y<4;y++)
    	a[i+x][j+y]=cnt++;
    }
    
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
                cout<<a[i][j]<<" ";
           
        }
        cout<<endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game
1382A - Common Subsequence
1512D - Corrupted Array
667B - Coat of Anticubism
284B - Cows and Poker Game
1666D - Deletive Editing
1433D - Districts Connection
2B - The least round way
1324A - Yet Another Tetris Problem
246B - Increase and Decrease
22E - Scheme
1566A - Median Maximization
1278A - Shuffle Hashing
1666F - Fancy Stack